Randomized interpolative decomposition of separated representations
نویسندگان
چکیده
منابع مشابه
Randomized interpolative decomposition of separated representations
We introduce an algorithm to compute tensor Interpolative Decomposition (tensor ID) for the reduction of the separation rank of Canonical Tensor Decompositions (CTDs). Tensor ID selects, for a user-defined accuracy ǫ, a near optimal subset of terms of a CTD to represent the remaining terms via a linear combination of the selected terms. Tensor ID can be used as an alternative to or in combinati...
متن کاملWell Separated Pairs Decomposition
Instead of maintaining such a decomposition explicitly, it is convenient to construct a compressed quadtree T of the points of P , and every pair, (Ai, Bi) is just a pair of nodes (vi, ui) of T , such that Ai = Pvi and Bi = Pui , where Pv denote the points of P stored in the subtree of v, where v is a node of T . This gives us a compact representation of the distances. We slightly modify the co...
متن کاملA CUR Factorization Algorithm based on the Interpolative Decomposition
An algorithm for the efficient computation of the CUR decomposition is presented. The method is based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized library codes can be utilized for its implementation. Numerical experiments demonstrate advantageous performance compared to existing techniques for computing CUR factorizations.
متن کاملThe well-separated pair decomposition for balls
Given a real number t > 1, a geometric t-spanner is a geometric graph for a point set in R with straight lines between vertices such that the ratio of the shortest-path distance between every pair of vertices in the graph (with Euclidean edge lengths) to their actual Euclidean distance is at most t. An imprecise point set is modeled by a set R of regions in R. If one chooses a point in each reg...
متن کاملI/O-Efficient Well-Separated Pair Decomposition
We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set S in Rd in O(sort(N)) I/Os, where N is the number of points in S and sort(N) denotes the I/O-complexity of sorting N items. (Throughout this paper, we assume that the dimension d is fixed). As applications of the WSPD, we show how to compute a linear-size t-spanner for S within the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2015
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2014.10.009